Constructing Robust Dynamic Peer-to-Peer Systems
نویسندگان
چکیده
Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O( log n log log n ), where n is the total number of peers in the system.
منابع مشابه
A Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملConstructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
Current peer-to-peer (P2P) file sharing applications are remarkably simple and robust, but their inefficiency can produce very high network loads. The use of superpeers has been proposed to improve the performance of unstructured P2P systems. These have the potential to approach the performance and scalability of structured systems, while retaining the benefits of unstructured P2P systems. Ther...
متن کاملTowards a Model of Computer Systems Research
Peer to peer systems have become a popular area of distributed systems research over the past few years, reflecting both the widespread use of systems like BitTorrent [5] and the emerging commercial potential of peer to peer systems for a variety of applications well beyond file sharing [4, 14, 20, 21, 22]. This line of research has resulted in substantial progress in understanding system behav...
متن کاملA framework for proving the self-organization of dynamic systems
This paper aims at providing a rigorous definition of selforganization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, cooperative robotics, or ad-hoc networks). We characterize different classes of self-organization through liveness and safety properties that both capture information regarding the system entropy. We illustrate these classes...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کامل